43 research outputs found
Max flow vitality in general and -planar graphs
The \emph{vitality} of an arc/node of a graph with respect to the maximum
flow between two fixed nodes and is defined as the reduction of the
maximum flow caused by the removal of that arc/node. In this paper we address
the issue of determining the vitality of arcs and/or nodes for the maximum flow
problem. We show how to compute the vitality of all arcs in a general
undirected graph by solving only max flow instances and, In
-planar graphs (directed or undirected) we show how to compute the vitality
of all arcs and all nodes in worst-case time. Moreover, after
determining the vitality of arcs and/or nodes, and given a planar embedding of
the graph, we can determine the vitality of a `contiguous' set of arcs/nodes in
time proportional to the size of the set.Comment: 12 pages, 3 figure
On the Galois Lattice of Bipartite Distance Hereditary Graphs
We give a complete characterization of bipartite graphs hav- ing tree-like Galois lattices. We prove that the poset obtained by deleting bottom and top elements from the Galois lattice of a bipartite graph is tree-like if and only if the graph is a Bipartite Distance Hereditary graph. We show that the lattice can be realized as the containment relation among directed paths in an arborescence. Moreover, a compact encoding of Bipartite Distance Hereditary graphs is proposed, that allows optimal time computation of neighborhood intersections and maximal bicliques
A tight relation between series--parallel graphs and bipartite distance hereditary graphs
Bandelt and Mulderâs structural characterization of bipartite distance hereditary graphs asserts that such graphs can be built inductively starting from a single vertex and by re17 peatedly adding either pendant vertices or twins (i.e., vertices with the same neighborhood as an existing one). Dirac and Duffinâs structural characterization of 2âconnected seriesâparallel graphs asserts that such graphs can be built inductively starting from a single edge by adding either edges in series or in parallel. In this paper we give an elementary proof that the two constructions are the same construction when bipartite graphs are viewed as the fundamental graphs of a graphic matroid. We then apply the result to re-prove known results concerning bipartite distance hereditary graphs and seriesâparallel graphs and to provide a new class of polynomially-solvable instances for the integer multi-commodity flow of maximum valu
On computing the Galois lattice of Bipartite Distance Hereditary graphs
The class of Bipartite Distance Hereditary (BDH) graphs is the intersection between bipartite domino-free and chordal bipartite graphs. Graphs in both the latter classes have linearly many maximal bicliques, implying the existence of polynomial-time algorithms for computing the associated Galois lattice. Such a lattice can indeed be built in
worst-case time for a domino-free graph with
edges and
vertices. In Apollonio et al. (2015), BDH graphs have been characterized as those bipartite graphs whose Galois lattice is tree-like. In this paper we give a sharp upper bound on the number of maximal bicliques of a BDH graph and we provide an
time-worst-case algorithm for incrementally computing its Galois lattice. The algorithm in turn implies a constructive proof of the if part of the characterization above. Moreover, we give an
worst-case space and time encoding of both the input graph and its Galois lattice, provided that the reverse of a Bandelt and Mulder building sequence is given
A Low Arithmetic-Degree Algorithm for Computing Proximity Graphs
In this paper, we study the problem of designing robust algorithms for computing the minimum spanning tree, the nearest neighbor graph, and the relative neighborhood graph of a set of points in the plane, under the Euclidean metric. We use the term ârobustâ to denote an algorithm that can properly handle degenerate configurations of the input (such as co-circularities and collinearities) and that is not affected by errors in the flow of control due to round-off approximations. Existing asymptotically optimal algorithms that compute such graphs are either suboptimal in terms of the arithmetic precision required for the implementation, or cannot handle degeneracies, or are based on complex data structures.
We present a unified approach to the robust computation of the above graphs. The approach is a variant of the general region approach for the computation of proximity graphs based on Yao graphs, first introduced in Ref. 43 (A. C.-C. Yao, On constructing minimum spanning trees in k
-dimensional spaces and related problems, SIAM J. Comput.11(4) (1982) 721â736). We show that a sparse supergraph of these geometric graphs can be computed in asymptotically optimal time and space, and requiring only double precision arithmetic, which is proved to be optimal. The arithmetic complexity of the approach is measured by using the notion of degree, introduced in Ref. 31 (G. Liotta, F. P. Preparata and R. Tamassia, Robust proximity queries: An illustration of degree-driven algorithm design, SIAM J. Comput.28(3) (1998) 864â889) and Ref. 3 (J. D. Boissonnat and F. P. Preparata, Robust plane sweep for intersecting segments, SIAM J. Comput.29(5) (2000) 1401â1421).
As a side effect of our results, we solve a question left open by Katajainen27 (J. Katajainen, The region approach for computing relative neighborhood graphs in the Lp
metric, Computing40 (1987) 147â161) about the existence of a subquadratic algorithm, based on the region approach, that computes the relative neighborhood graph of a set of points S in the plane under the L2 metric
On the complexity of recognizing directed path families
A Directed Path Family is a family of subsets of some finite ground set whose members call be realized as arc sets of simple directed paths in some directed graph. In this paper we show that recognizing whether a given family is a Directed Path family is an NP-Complete problem, even when all members in the family have at most two elements. If instead of a family of subsets, we are given a collection of words from some finite alphabet, then deciding whether there exists a directed graph G Such that each word ill the language is the set of arcs of some path in G, is a polynomial-time solvable problem. (C) 2009 Elsevier B.V. All rights reserved